On 2 nonsplit extension groups associated with HS and HS:2
نویسندگان
چکیده
منابع مشابه
On graphs and codes associated to the sporadic simple groups HS and M22
We provide a new construction of the strongly regular graphs associated with the two sporadic simple groups M22 and HS. Further, we give some new constructions of other known strongly regular graphs by taking the orbits of a certain subgroup of M22 on the planes of the Hermitian variety H(5, 4). These geometric constructions can be used to produce cap codes with large parameters and automorphis...
متن کاملElliptic curves with nonsplit mod 11 representations
We calculate explicitly the j-invariants of the elliptic curves corresponding to rational points on the modular curve X+ ns(11) by giving an expression defined over Q of the j-function in terms of the function field generators X and Y of the elliptic curve X+ ns(11). As a result we exhibit infinitely many elliptic curves over Q with nonsplit mod 11 representations.
متن کاملOn rational groups with Sylow 2-subgroups of nilpotency class at most 2
A finite group $G$ is called rational if all its irreducible complex characters are rational valued. In this paper we discuss about rational groups with Sylow 2-subgroups of nilpotency class at most 2 by imposing the solvability and nonsolvability assumption on $G$ and also via nilpotency and nonnilpotency assumption of $G$.
متن کاملEarthquake and the Educational Needs of People With Physical Disabilities and Associated Groups: A Qualitative Study
Objective: People with disabilities are highly vulnerable during disasters and their mortality is higher than normal population. The causes of this vulnerability, in addition to the physical problems and movement limitations, can be lack of their knowledge in facing with disasters. Such deficiencies can adversely affect their preparedness surviving in the disastrous situations and cause adverse...
متن کاملNonsplit Domination Edge Critical Graphs
A set of vertices S is said to dominate the graph G if for each v / ∈ S, there is a vertex u ∈ S with u adjacent to v. The minimum cardinality of any dominating set is called the domination number of the graph G and is denoted by γ(G). A dominating set D of a graph G = (V,E) is a nonsplit dominating set if the induced graph 〈V − D〉 is connected. The nonsplit domination number γns(G) of the grap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TURKISH JOURNAL OF MATHEMATICS
سال: 2014
ISSN: 1300-0098,1303-6149
DOI: 10.3906/mat-1209-11